On Subadditive Duality for Conic Mixed-integer Programs
نویسندگان
چکیده
منابع مشابه
Strong Dual for Conic Mixed-Integer Programs∗
Mixed-integer conic programming is a generalization of mixed-integer linear programming. In this paper, we present an extension of the duality theory for mixed-integer linear programming (see [4], [11]) to the case of mixed-integer conic programming. In particular, we construct a subadditive dual for mixed-integer conic programming problems. Under a simple condition on the primal problem, we ar...
متن کاملOn Minimal Valid Inequalities for Mixed Integer Conic Programs
We study mixed integer conic sets involving a general regular (closed, convex, full dimensional, and pointed) cone K such as the nonnegative orthant, the Lorentz cone or the positive semidefinite cone. In a unified framework, we introduce K-minimal inequalities and show that under mild assumptions, these inequalities together with the trivial cone-implied inequalities are sufficient to describe...
متن کاملOn sublinear inequalities for mixed integer conic programs
This paper studies K-sublinear inequalities, a class of inequalities with strong relations to K-minimal inequalities for disjunctive conic sets. We establish a stronger result on the sufficiency of K-sublinear inequalities. That is, we show that when K is the nonnegative orthant or the second-order cone, K-sublinear inequalities together with the original conic constraint are always sufficient ...
متن کاملDuality for Mixed Integer Linear Programs
The theory of duality for linear programs is well-developed and has been successful in advancing both the theory and practice of linear programming. In principle, much of this broad framework can be extended to mixed integer linear programs, but this has proven difficult, in part because duality theory does not integrate well with current computational practice. This paper surveys what is known...
متن کاملConic mixed-integer rounding cuts
A conic integer program is an integer programming problem with conic constraints.Manyproblems infinance, engineering, statistical learning, andprobabilistic optimization aremodeled using conic constraints. Herewe studymixed-integer sets definedby second-order conic constraints.We introduce general-purpose cuts for conic mixed-integer programming based on polyhedral conic substructures of second...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Optimization
سال: 2019
ISSN: 1052-6234,1095-7189
DOI: 10.1137/18m1210812